Constructing Action Graphs for Planning
نویسندگان
چکیده
The problem of planning in a world can be seen as the problem of determining a sequence of world changes which allows to reach a goal state from a given initial state, each world change being caused by an action. We present here a planning system which is constructed on a logical action formalism, where actions are pairs of formulas (precondition, result). The precondition describes what has to be true in a state for an action to be performed; the result describes what will be true in a state after the execution of the action. Actions occur in worlds which are also determined by general laws which remain always true throughout the changes. These general laws de ne which are the states possible for a world. These possible states can be obtained from the implicants of the general laws. Given a planning problem, we show how to obtain, without backtracking, a graph representing the minimal solutions for it. keywords: Deductive planning, action theory, persistencies, shortest path search, subgraph computation.
منابع مشابه
Constructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملSearch Graph Formation for Minimizing the Complexity of Planning
A large number of path planning problems are solved by the use of graph based search algorithms. There are a variety of techniques available to optimize the search within these graphs as well as thorough studies of the complexity involved in searching through them. However, little effort has been dedicated to constructing the graphs so that the results of searching will be optimized. The common...
متن کاملCSE 190, Great ideas in algorithms: Expander graphs
Our interest however will be in constructing large but very sparse graphs (ideally with d = 3) for which h(G) ≥ c for some absolute constant c > 0. Such graphs are “highly connected” graphs. For example, the following lemma shows that by deleting a few edges in such graphs, we can only disconnect a few vertices. This is very useful for example in network design, where we want the failure of edg...
متن کاملFast Planning in Domains with Derived Predicates: An Approach Based on Rule-Action Graphs and Local Search
The ability to express “derived predicates” in the formalization of a planning domain is both practically and theoretically important. In this paper, we propose an approach to planning with derived predicates where the search space consists of “Rule-Action Graphs”, particular graphs of actions and rules representing derived predicates. We present some techniques for representing rules and reaso...
متن کامل